On solving a hard quadratic 3-dimensional assignment problem
نویسندگان
چکیده
منابع مشابه
On solving a hard quadratic 3-dimensional assignment problem
We address the exact solution of a very challenging (and previously unsolved) instance of the quadratic 3-dimensional assignment problem, arising in digital wireless communications. When error correction of a transmitted message is not possible, an automatic repeat request (ARQ) may be sent. For the case of PSK coding we describe the techniques developed to solve this instance to proven optimal...
متن کاملsolving quadratic assignment problem (qap) using invasive weed optimization algorithm
a new powerful optimization algorithm inspired from colonizing weeds is utilized to solve the well-known quadratic assignment problem (qap) which is of application in a large number of practical areas such as plant layout, machinery layout and so on. a set of reference numerical problems from qaplib is taken in order to evaluate the efficiency of the algorithm compared with the previous ones wh...
متن کاملA Complex Search Technique for Solving the Quadratic Assignment Problem
An algorithm recently developed by Enkhbat et al. [3] based on continuous relaxation of the quadratic assignment problem generates suboptimal solution of good quality on average giving no sufficient enough verification on global optimality of the generated solution, whereas a branch and bound method provides a solution with verified global optimality, taking on input an upper bound close to glo...
متن کاملA Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کاملA Genetic Algorithm for solving Quadratic Assignment Problem(QAP)
The Quadratic Assignment Problem (QAP) is one of the models used for the multi-row layout problem with facilities of equal area. There are a set of n facilities and a set of n locations. For each pair of locations, a distance is specified and for each pair of facilities a weight or flow is specified (e.g., the amount of supplies transported between the two facilities). The problem is to assign ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming Computation
سال: 2015
ISSN: 1867-2949,1867-2957
DOI: 10.1007/s12532-015-0077-3